Fence-sitters Protect Cooperation in Complex Networks

نویسندگان

  • Yichao Zhang
  • M. A. Aziz-Alaoui
  • Cyrille Bertelle
  • Shi Zhou
  • Wenting Wang
چکیده

Evolutionary game theory is one of the key paradigms behind many scientific disciplines from science to engineering. In complex networks, because of the difficulty of formulating the replicator dynamics, most of the previous studies are confined to a numerical level. In this paper, we introduce a vectorial formulation to derive three classes of individuals' payoff analytically. The three classes are pure cooperators, pure defectors, and fence-sitters. Here, fence-sitters are the individuals who change their strategies at least once in the strategy evolutionary process. As a general approach, our vectorial formalization can be applied to all the two-strategy games. To clarify the function of the fence-sitters, we define a parameter, payoff memory, as the number of rounds that the individuals' payoffs are aggregated. We observe that the payoff memory can control the fence-sitters' effects and the level of cooperation efficiently. Our results indicate that the fence-sitters' role is nontrivial in the complex topologies, which protects cooperation in an indirect way. Our results may provide a better understanding of the composition of cooperators in a circumstance where the temptation to defect is larger.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The network secrets of great change agents.

Change is hard, especially in a large organization. Yet some leaders succeed--often spectacularly--at transforming their workplaces. what makes them able to exert this sort of influence when the vast majority can't? The authors tracked 68 change initiatives in the UK's National Health Service, an organization whose size, complexity, and tradition can make reform difficult. They discovered sever...

متن کامل

Fence Monitoring - Experimental Evaluation of a Use Case for Wireless Sensor Networks

In-network data processing and event detection on resourceconstrained devices are widely regarded as distinctive and novel features of wireless sensor networks. The vision is that through cooperation of many sensor nodes the accuracy of event detection can be greatly improved. On the practical side however, little real-world experience exists in how far these goals can be achieved. In this pape...

متن کامل

Overcoming Resistance to Organizational Change: Strong Ties and Affective Cooptation

We propose a relational theory of how change agents in organizations use the strength of ties in their network to overcome resistance to change. We argue that strong ties to potentially influential organization members who are ambivalent about a change (fence-sitters) provide the change agent with an affective basis to coopt them. This cooptation increases the probability that the organization ...

متن کامل

Modeling Cooperation between Nodes in Wireless Networks by APD Game

Cooperation is the foundation of many protocols in wireless networks. Without cooperation, the performance of a network significantly decreases. Hence, all nodes in traditional networks are required to cooperate with each other. In this paper, instead of traditional networks, a network of rational and autonomous nodes is considered, which means that each node itself can decide whe...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Physical review. E, Statistical, nonlinear, and soft matter physics

دوره 88 3  شماره 

صفحات  -

تاریخ انتشار 2013